// 2025/4/2
// https://leetcode.cn/problems/longest-common-subsequence/description/?envType=study-plan-v2&envId=top-100-liked
// 最长公共子序列

class Solution {
    public:
        int longestCommonSubsequence(string text1, string text2) {
            int m = text1.size(), n = text2.size();
            vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
            for(int i = 1; i <= m; i++)
            {
                for(int j = 1; j <= n; j++)
                {
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                    int k = text1[i - 1] == text2[j - 1] ? 1 : 0;
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + k);
                }
            }
            return dp[m][n];
        }
    };